package com.wc.算法提高课.A第一章_动态规划.背包模型.买书;

import java.io.PrintWriter;
import java.util.Scanner;

/**
 * @Author congge
 * @Date 2024/5/9 15:46
 * @description https://www.acwing.com/problem/content/1025/
 */
public class Main {
    /**
     * 完全背包
     */
    static Scanner sc = new Scanner(System.in);
    static PrintWriter out = new PrintWriter(System.out);
    static int N = 1010;
    static long[] f = new long[N];
    static int n;

    public static void main(String[] args) {
        f[0] = 1;
        n = sc.nextInt();
        int[] w = new int[]{0, 10, 20, 50, 100};
        for (int i = 1; i <= 4; i++) {
            for (int j = w[i]; j <= n; j++) {
                f[j] += f[j - w[i]];
            }
        }
        out.println(f[n]);
        out.flush();
    }
}
